Bitonic st-orderings for Upward Planar Graphs
نویسنده
چکیده
Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While st-orderings do extend to directed graphs, especially planar st-graphs, they do not offer the same properties as canonical orderings. In this work we extend the so called bitonic st-orderings to directed graphs. We fully characterize planar st-graphs that admit such an ordering and provide a lineartime algorithm for recognition and ordering. If for a graph no bitonic st-ordering exists, we show how to find in linear time a minimum set of edges to split such that the resulting graph admits one. With this new technique we are able to draw every upward planar graph on n vertices by using at most one bend per edge, at most n − 3 bends in total and within quadratic area.
منابع مشابه
Planar L-Drawings of Directed Graphs
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upwardplanar L-drawings. We show that directed st-graphs admitting an upward(resp. upward-rightward-) planar L-drawing are exactly ...
متن کاملBitonic st-orderings of Biconnected Planar Graphs
Vertex orderings play an important role in the design of graph drawing algorithms. Compared to canonical orderings, st-orderings lack a certain property that is required by many drawing methods. In this paper, we propose a new type of st-ordering for biconnected planar graphs that relates the ordering to the embedding. We describe a linear-time algorithm to obtain such an ordering and demonstra...
متن کاملUniversal Slope Sets for Upward Planar Drawings
We prove that every set S of ∆ slopes containing the horizontal slope is universal for 1-bend upward planar drawings of bitonic st-graphs with maximum vertex degree ∆, i.e., every such digraph admits a 1-bend upward planar drawing whose edge segments use only slopes in S. This result is worst-case optimal in terms of the number of slopes, and, for a suitable choice of S, it gives rise to drawin...
متن کاملDrawing algorithms for planar st-graphs
We present a survey on algorithms for drawing planar digraphs such that the arcs do not intersect and are monotonically increasing in the vertical direction (upward planar drawings). Various graphic standards (e.g., and quality measures bends) are considered.
متن کاملThe Duals of Upward Planar Graphs on Cylinders
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.
متن کامل